Optimal and suboptimal models of oddity search
نویسندگان
چکیده
منابع مشابه
Faster Optimal and Suboptimal Hierarchical Search By
FASTER OPTIMAL AND SUBOPTIMAL HIERARCHICAL SEARCH by Michael Leighton University of New Hampshire, May, 2012 In problem domains for which an informed admissible heuristic function is not available, one attractive approach is hierarchical search. Hierarchical search uses search in an abstracted version of the problem to dynamically generate heuristic values. This thesis makes three contributions...
متن کاملFaster Optimal and Suboptimal Hierarchical Search
Nodes Expanded (100K) CPU Time (s) Algorithm Weight Solved Sub-optimality Mean Median Mean Median Switch 100 1.13 0.29 0.20 0.10 0.06 Short Circuit 100 1 1.39 0.91 0.89 0.55 Short Circuit WA* 1.1 100 1.01 1.69 1.28 1.10 0.81 ” ” 1.2 100 1.03 2.39 1.89 1.59 1.24 ” ” 2 100 1.24 6.34 6.77 4.46 5.00 ” ” 5 100 1.44 6.03 8.06 4.22 5.75 ” ” 10 100 1.53 5.51 6.34 3.84 4.52 Short Circuit Greedy 100 5.17...
متن کاملParallel Best-First Search: Optimal and Suboptimal Solutions
To harness modern multi-core processors, it is imperative to develop parallel versions of fundamental algorithms. In this paper, we present a general approach to best-first heuristic search in a shared-memory setting. Each thread attempts to expand the most promising nodes. By using abstraction to partition the state space, we detect duplicate states while avoiding lock contention. We allow spe...
متن کاملOptimal inference with suboptimal models: Addiction and active Bayesian inference
When casting behaviour as active (Bayesian) inference, optimal inference is defined with respect to an agent's beliefs - based on its generative model of the world. This contrasts with normative accounts of choice behaviour, in which optimal actions are considered in relation to the true structure of the environment - as opposed to the agent's beliefs about worldly states (or the task). This di...
متن کاملSimpler Bounded Suboptimal Search
It is commonly appreciated that solving search problems optimally can take too long. Bounded suboptimal search algorithms trade increased solution cost in a principled way for reduced solving time. Explicit Estimation Search (EES) is a recent state-of-the-art algorithm for bounded suboptimal search. Although it tends to expand fewer nodes than alternative algorithms, its per-node expansion over...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Vision
سال: 2005
ISSN: 1534-7362
DOI: 10.1167/5.8.954